A MULTILEVEL FAST MULTIPOLE METHOD WITH SPHERICAL HARMONICS EXPANSION OF THE k-SPACE INTEGRALS

نویسنده

  • T. F. Eibert
چکیده

A novel diagonalized multilevel fast multipole method (MLFMM) for time harmonic Maxwell’s equations is proposed which realizes considerable memory savings without compromising accuracy and computational speed. The improvement is achieved by expanding the k-space integrals over the unit sphere in spherical harmonics. Since the spherical harmonics expansion is carried out for cartesian vector components of the expansion functions, only very few expansion coefficients are required. Aggregations, plane wave translations, and disaggregations are performed using the k-space samples of a numerical quadrature rule. However, the incoming plane waves on the finest MLFMM level are expanded in spherical harmonics again. Thus, due to the orthonormality of spherical harmonics the testing integrals for the individual testing functions are simplified into series over products of spherical harmonics expansion coefficients. INTRODUCTION Method of moments (MoM) solutions of integral equations are among the most successful numerical methods for the solution of electromagnetics radiation and scattering problems. Most important is its robustness and insensitivity against dispersion errors. The drawback of large computation complexity due to the fully-populated system matrices has been overcome since the introduction of fast integral methods such as the MLFMM [1][2][3]. In this paper, we concentrate on diagonalized FMM algorithms using propagating plane waves. These are typically based on numerical integration of the corresponding k-space integrals over the Ewald sphere. The quadrature sampling rate is dictated by the spectral content of the diagonalized translation operator and this results in oversampling of the k-space representations of the basis/testing functions of the method of moments (MoM) procedure employed to solve the integral equation [4]. To obtain a computationally efficient algorithm, the k-space samples of the basis/testing functions should be pre-computed and stored in core memory of the computer prior to starting the iteration procedure. Due to the aforementioned oversampling, a large amount of core memory is wasted and considerable memory savings can be achieved by using a more adequate k-space representation of the basis/testing functions. In this paper, the concept of spherical harmonics expansions of the k-space integrals motivated by an efficient k-space representation of the basis/testing functions is worked out. It is shown how a computationally efficient MLFMM algorithm can be realized leading to considerable memory reductions as compared to previous implementations. FORMULATION We consider a time harmonic (time dependence e ) surface integral equation formulation using the electric field integral equation (EFIE) for metallic objects. However, the presented ideas can be applied to MFIE and combined field integral equation (CFIE) formulations for metallic and dielectric objects as well. According to [2][5], a Galerkin-type MoM equation system can be derived as

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using Fast Fourier Transform in the 3-d Multilevel Fast Multipole Algorithm

In this paper a method is presented how to perform interpolation and anterpolation in both spherical coordinates θ and φ by trigonometric polynomials and the fast Fourier transform (FFT) in the 3-D multilevel fast multipole algorithm (MLFMA). The proposed method is exact in interpolation and anterpolation, and has the high numerical efficiency of FFT. A numerical comparison suggests that the pr...

متن کامل

A Fast Spherical Filter with Uniform Resolution

for transforming Legendre polynomial expansions, but it appears not to generalize to the spherical case. This paper introduces a fast algorithm for obtaining a uniform resolution representation of a function known at a latitude– Swarztrauber [12] has reviewed other transformation algolongitude grid on the surface of a sphere, equivalent to a triangular, rithms. isotropic truncation of the spher...

متن کامل

A Multipole Based Treecode Using Spherical Harmonics for Potentials of the Form r-lambda

In this paper we describe an efficient algorithm for computing the potentials of the form r−λ where λ ≥ 1. This treecode algorithm uses spherical harmonics to compute multipole coefficients that are used to evaluate these potentials. The key idea in this algorithm is the use of Gegenbauer polynomials to represent r−λ in a manner analogous to the use of Legendre polynomials for the expansion of ...

متن کامل

Adaptation and Performance of the Cartesian Coordinates Fast Multipole Method for Nanomagnetic Simulations

An implementation of the fast multiple method (FMM) is performed for magnetic systems with long-ranged dipolar interactions. Expansion in spherical harmonics of the original FMM is replaced by expansion of polynomials in cartesian coordinates, which is considerably simpler. Under open boundary conditions, an expression for multipole moments of point dipoles in a cell is derived. These make the ...

متن کامل

Fourier-Based Fast Multipole Method for the Helmholtz Equation

The multilevel fast multipole method (MLFMM) is an algorithm that has had great success in reducing the computational time required to find the solution to the Galerkin boundary integral form of the Helmholtz equation. We present a new formulation of the MLFMM using Fourier basis functions rather than spherical harmonics in order to accelerate and simplify the time-critical stages of the algori...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004